Describing, Simulating, and Optimizing Hierarchial Bus Scheduling Policies
نویسنده
چکیده
We present a tool suite for working with hierarchical bus schedule/arbitration descriptions for nodes sharing a bus in real-time applications. These schedules can be based on a variety of factors including time slicing and the characteristics of messages. These schedules are represented in a tree-like structure. Using this structure we can describe many popular arbitration schemes, and automatically evaluate them using our simulator that implements the scheduling policy of the tree. Additionally, we provide a genetic algorithm for automatically exploring the design space. As a proof of concept we apply these tools to several real examples. Chapter
منابع مشابه
Scheduling Algorithms with Bus Bandwidth Considerations for SMPs
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focus on memory hierarchy optimizations and do not address the bus bandwidth limitations directly. In this paper, we first present experimental results which indicate that bus saturation can cause an up to almost three-fol...
متن کاملMONARC Simulation Framework
This paper discusses the latest generation of the MONARC (MOdels of Networked Analysis at Regional Centers) simulation framework, as a design and modelling tool for large scale distributed systems applied to HEP experiments. A process-oriented approach for discrete event simulation is well-suited for describing concurrent running programs, as well as the stochastic arrival patterns that charact...
متن کاملPower-Aware Bus Coscheduling for Periodic Realtime Applications Running on Multiprocessor SoC
Execution time for realtime processes running on multiprocessor systemon-chip platform varies due to the contention on the bus. Considering the worst case execution cycles necessitates over-clocking the system to meet the realtime deadlines, which has a negative impact on the system power requirements. For periodic applications coscheduled on multiprocessor with shared bus, the cycles needed by...
متن کاملTitle Of Dissertation : UNDERSTANDING AND OPTIMIZING HIGH - SPEED SERIAL MEMORY SYSTEM ARCHITECTURES
Title Of Dissertation: UNDERSTANDING AND OPTIMIZING HIGH-SPEED SERIAL MEMORY SYSTEM ARCHITECTURES Brinda Ganesh, Doctor of Philosophy, 2007 Dissertation Directed by: Professor Bruce Jacob Department of Electrical and Computer Engineering Performance improvements in memory systems have traditionally been obtained by scaling data bus width and speed. Maintaining this trend while continuing to sat...
متن کاملExact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem
As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002